Genetic Algorithm: Simple to Parallel Implementation using MapReduce
نویسندگان
چکیده
Simple Genetic Algorithms are used to solve optimization problems. Genetic Algorithm also comes with a parallel implementation as Parallel Genetic Algorithm (PGA). PGA can be used to reduce the execution time of SGA and also to solve larger size instances of problems. In this paper, different implementations for PGA have been discussed with their frameworks. In this implementation, all PGA are based on a single SGA framework. These are executed on a parallel machine and tested on some benchmark problem instances of Traveling Salesman problem (TSP) from TSPLIB. TSPLIB is a well known library for data set of benchmark problem instances. A basic framework has been proposed for implementing PGA on today’s parallel computers. General Terms Genetic Algorithm, Parallel Genetic Algorithm, Traveling Salesman Problem
منابع مشابه
Scaling Simple and Compact Genetic Algorithms using MapReduce
Genetic algorithms(GAs) are increasingly being applied to large scale problems. The traditional MPI-based parallel GAs require detailed knowledge about machine architecture. On the other hand, MapReduce is a powerful abstraction proposed by Google for making scalable and fault tolerant applications. In this paper, we show how genetic algorithms can be modeled into the MapReduce model. We descri...
متن کاملParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visits all the cities in list exactly once and ends in the city where it starts. Despite the Traveling Salesman Problem is NP-Hard, a lot of methods and solutions are proposed to th...
متن کاملParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visits all the cities in list exactly once and ends in the city where it starts. Despite the Traveling Salesman Problem is NP-Hard, a lot of methods and solutions are proposed to th...
متن کاملA Parallel Genetic Algorithm for Generalized Vertex Cover Problem
This paper presents a parallel genetic algorithm for generalised vertex cover problem( GVCP) using Hadoop Map-Reduce framework. The proposed Map-Reduce implementation helps to run the genetic algorithm for generalized vertex cover problem(GVCP) on multiple machines parallely and computes the solution in relatively short time. Keywords— Parallel genetic algorithm,generalized vertex cover problem...
متن کاملGenetic Algorithms with Mapreduce Runtimes
Data-intensive Computing has played a key role in processing vast volumes of data exploiting massive parallelism. Parallel computing frameworks have proven that terabytes of data can be routinely processed. Mapreduce is a parallel programming model and associated implementation founded by Google, which is one of the leading companies in IT. Genetic Algorithms have increasingly applied on parall...
متن کامل